M-based fold assignment
نویسندگان
چکیده
منابع مشابه
Motif-based fold assignment.
Conventional fold recognition techniques rely mainly on the analysis of the entire sequence of a protein. We present an MBA method to improve performance of any conventional sequence-based fold assignment. The method uses sequence motifs, such as those defined in the Prosite database, and the SwissProt annotation of the fold library. When combined with a simple SDP method, the coverage of MBA i...
متن کاملProbabilistic Assignment: A Two-fold Axiomatic Approach
We study the problem of allocating objects by means of probabilistic mechanisms. Each agent has strict preferences over objects and ex post receives exactly one object. A standard approach in the literature is to extend agents' preferences over objects to preferences over lotteries de ned on those objects, using the rst-order stochastic dominance criterion, or the sd-extension. In a departure f...
متن کاملOblivious Assignment with m Slots
Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues to be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource R (with m ≥ 1), allowing processes to compete in order to get a slot of R, while...
متن کاملTOPOLOGICAL ENTROPY OF m-FOLD MAPS
We investigate the relation between preimage multiplicity and topological entropy for continuous maps. An argument originated by Misiurewicz and Przytycki shows that if every regular value of a C1 map has at least m preimages then the topological entropy of the map is at least log m. For every integer, there exist continuous maps of the circle with entropy zero for which every point has at leas...
متن کامل(n,m)-Fold Covers of Spheres
A well known consequence of the Borsuk-Ulam theorem is that if the d-dimensional sphere S is covered with less than d + 2 open sets, then there is a set containing a pair of antipodal points. In this paper we provide lower and upper bounds on the minimum number of open sets, not containing a pair of antipodal points, needed to cover the d-dimensional sphere n times, with the additional property...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Protein Science
سال: 2001
ISSN: 0961-8368,1469-896X
DOI: 10.1110/ps.ps.14401